Using Temporal Abstraction to Understand Recursive Programs Involving Side Effects
نویسندگان
چکیده
This paper develops the notion of temporal abstraction, used originally for the automatic understanding of looping constructs, to account for a class of recursive programs involving side effects upon a relational data base. The programs may involve compositions of several side effects, and these side effects can occur either during descent or upon ascent from recursive calls.
منابع مشابه
Model Checking Recursive Programs with Exact Predicate Abstraction
We propose an approach for analyzing non-termination and reachability properties of recursive programs using a combination of overand underapproximating abstractions. First, we define a new concrete program semantics, mixed, that combines both natural and operational semantics, and use it to design an on-the-fly symbolic algorithm. Second, we combine this algorithm with abstraction by following...
متن کاملInteracting via the Heap in the Presence of Recursion
Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call s...
متن کاملPrefrontal cortex organization: dissociating effects of temporal abstraction, relational abstraction, and integration with FMRI.
The functions of the prefrontal cortex (PFC) underlie higher-level cognition. Varying proposals suggest that the PFC is organized along a rostral-caudal gradient of abstraction with more abstract representations/processes associated with more rostral areas. However, the operational definition of abstraction is unclear. Here, we contrasted 2 prominent theories of abstraction--temporal and relati...
متن کاملThe Principles of Ambient Calculus Revisited
The paper presents a foundational analysis of the class of ambient calculi focussing on the spatial structures of the processes they can describe. We propose sound correct set-theoretical models for different types of ambient calculi (involving recursion, denumerable parallel composition, etc) by using special types of coalgebras labelled flat systems of equations of set theory. These models he...
متن کاملPARES – A Model for Parallel Recursive Programs
PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1982